An inversion formula, matrix functions, combinatorial identities and graphs
نویسندگان
چکیده
منابع مشابه
Rational Functions Certify Combinatorial Identities
This paper presents a general method for proving and discovering combinatorial identities: to prove an identity one can present a certi cate that consists of a pair of functions of two integer variables. To prove the identity, take the two functions that are given, check that condition (1) below is satis ed (a simple mechanical task), and check the equally simple fact that the boundary conditio...
متن کاملPowers of a Matrix and Combinatorial Identities
In this article we obtain a general polynomial identity in k variables, where k ≥ 2 is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a k × k matrix. Finally, we use these results to derive various combinatorial identities.
متن کاملMultiplicative Functions and Möbius Inversion Formula
Examples. Let n ∈ N. Define functions τ, σ, π : N → N as follows: • τ(n) = the number of all natural divisors of n = #{d > 0 | d|n}; • σ(n) = the sum of all natural divisors of n = ∑ d|nd; • π(n) = the product of all natural divisors of n = ∏ d|nd. As we shall see below, τ and σ are multiplicative functions, while π is not. From now on we shall write the prime decomposition of n ∈ N as n = p1 1...
متن کاملPartition functions and graphs: A combinatorial approach
Although symmetry methods and analysis are a necessary ingredient in every physicist’s toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the partition function, for example, is essentially a combinatorial problem. In this talk we shall show that one approach is via the normal ordering of the second qua...
متن کاملStatistics on Graphs, Exponential Formula and Combinatorial Physics
The concern of this paper is a famous combinatorial formula known under the name “exponential formula”. It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential generating function of a whole structure is equal to the exponential of those of connected substructures. Keeping this descriptive statement as a guideline,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1973
ISSN: 0528-2195
DOI: 10.21136/cpm.1973.117796